circuit algebra

circuit algebra
grandinių algebra statusas T sritis fizika atitikmenys: angl. circuit algebra vok. Schaltalgebra, f; Schaltungsalgebra, f rus. алгебра схем, f; схемная алгебра, f pranc. algèbre des circuits, f

Fizikos terminų žodynas : lietuvių, anglų, prancūzų, vokiečių ir rusų kalbomis. – Vilnius : Mokslo ir enciklopedijų leidybos institutas. . 2007.

Игры ⚽ Поможем сделать НИР

Look at other dictionaries:

  • circuit algebra — grandinių algebra statusas T sritis automatika atitikmenys: angl. circuit algebra vok. Schaltungsalgebra, f rus. алгебра схем, f; алгебра цепей, f; схемная алгебра, f pranc. algèbre de circuits, f; algèbre de réseaux, f …   Automatikos terminų žodynas

  • Circuit minimization — In Boolean algebra, circuit minimization is the problem of obtaining the smallest logic circuit (Boolean formula) that represents a given Boolean function or truth table. The general circuit minimization problem is believed to be intractable,[1]… …   Wikipedia

  • grandinių algebra — statusas T sritis automatika atitikmenys: angl. circuit algebra vok. Schaltungsalgebra, f rus. алгебра схем, f; алгебра цепей, f; схемная алгебра, f pranc. algèbre de circuits, f; algèbre de réseaux, f …   Automatikos terminų žodynas

  • grandinių algebra — statusas T sritis fizika atitikmenys: angl. circuit algebra vok. Schaltalgebra, f; Schaltungsalgebra, f rus. алгебра схем, f; схемная алгебра, f pranc. algèbre des circuits, f …   Fizikos terminų žodynas

  • Boolean algebra — This article discusses the subject referred to as Boolean algebra. For the mathematical objects, see Boolean algebra (structure). Boolean algebra, as developed in 1854 by George Boole in his book An Investigation of the Laws of Thought,[1] is a… …   Wikipedia

  • Boolean algebra (logic) — For other uses, see Boolean algebra (disambiguation). Boolean algebra (or Boolean logic) is a logical calculus of truth values, developed by George Boole in the 1840s. It resembles the algebra of real numbers, but with the numeric operations of… …   Wikipedia

  • Canonical form (Boolean algebra) — In Boolean algebra, any Boolean function can be expressed in a canonical form using the dual concepts of minterms and maxterms. Minterms are called products because they are the logical AND of a set of variables, and maxterms are called sums… …   Wikipedia

  • Boolean algebra (structure) — For an introduction to the subject, see Boolean algebra#Boolean algebras. For the elementary syntax and axiomatics of the subject, see Boolean algebra (logic). For an alternative presentation, see Boolean algebras canonically defined. In abstract …   Wikipedia

  • integrated circuit — Electronics. a circuit of transistors, resistors, and capacitors constructed on a single semiconductor wafer or chip, in which the components are interconnected to perform a given function. Abbr.: IC Also called microcircuit. [1955 60] * * * ▪… …   Universalium

  • Boolean algebra (introduction) — Boolean algebra, developed in 1854 by George Boole in his book An Investigation of the Laws of Thought , is a variant of ordinary algebra as taught in high school. Boolean algebra differs from ordinary algebra in three ways: in the values that… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”